node splitting

node splitting
расщепление узлов

splitting of spectral lines — расщепление спектральных линий

splitting decomposition — разложение с расщеплением молекулы

splitting of energy levels — расщепление уровней энергии

spectroscopic splitting — расщепление спектральных линий

ground-state splitting — расщепление основного состояния

English-Russian big medical dictionary. 2005.

Смотреть что такое "node splitting" в других словарях:

  • B-tree — In computer science, a B tree is a tree data structure that keeps data sorted and allows searches, insertions, and deletions in logarithmic amortized time. It is most commonly used in databases and filesystems. In B trees, internal (non leaf)… …   Wikipedia

  • Branch and bound — (BB) is a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization. It consists of a systematic enumeration of all candidate solutions, where large subsets of… …   Wikipedia

  • Maximum flow problem — An example of a flow network with a maximum flow. The source is s, and the sink t. The numbers denote flow and capacity. In optimization theory, the maximum flow problem is to find a feasible flow through a single source, single sink flow network …   Wikipedia

  • расщепление узлов — — [Е.С.Алексеев, А.А.Мячев. Англо русский толковый словарь по системотехнике ЭВМ. Москва 1993] Тематики информационные технологии в целом EN node splitting …   Справочник технического переводчика

  • Implicit kd-tree — An implicit k d tree is a k d tree defined implicitly above a rectilinear grid. Its splitting planes positions and orientations are not given explicitly but implicitly by some recursive splitting function defined on the hyperrectangles belonging… …   Wikipedia

  • Hilbert R-tree — Hilbert R tree, an R tree variant, is an index for multidimensional objects like lines, regions, 3 D objects, or high dimensional feature based parametric objects. It can be thought of as an extension to B+ tree for multidimensional objects.The… …   Wikipedia

  • Kd-tree — In computer science, a k d tree (short for k dimensional tree ) is a space partitioning data structure for organizing points in a k dimensional space. k d trees are a useful data structure for several applications, such as searches involving a… …   Wikipedia

  • Kd-trie — A k d trie is a spatial data structure for indexing points in k dimensional space. It is a variation on the k d tree that only stores points in the leaf nodes, sometimes in small collections called bins or buckets. Internal nodes only store the… …   Wikipedia

  • Decision tree learning — This article is about decision trees in machine learning. For the use of the term in decision analysis, see Decision tree. Decision tree learning, used in statistics, data mining and machine learning, uses a decision tree as a predictive model… …   Wikipedia

  • Atrial septal defect — PFO redirects here. For the airport, see Paphos International Airport. Atrial septal defect Classification and external resources Heart of human embryo of about thirty five days ICD 10 …   Wikipedia

  • Glossary of botanical terms — Many of the terms used in Wikipedia glossaries (often most) are already defined and explained within Wikipedia itself. However, lists like the following indicate where new articles need to be written and are also useful for looking up and… …   Wikipedia

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.